Forbidden Symmetries

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forbidden Vertices

In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending o...

متن کامل

Forbidden Patterns

We consider the problem of indexing a collection of documents (a.k.a. strings) of total length n such that the following kind of queries are supported: given two patterns P and P−, list all nmatch documents containing P but not P−. This is a natural extension of the classic problem of document listing as considered by Muthukrishnan [SODA’02], where only the positive pattern P is given. Our main...

متن کامل

Forbidden Magnification ?

The twin of this paper, “Forbidden Magnification? I.” [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann [2] on data for which the theory does not guarantee success, namely data that are n-D, n > 2 and/or data whose components in the different dimensions are not statistically independent. For the unsupported n = 2 cases that we in...

متن کامل

Compact Forbidden-Set Routing

We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V , a path is X-constrained if all intermediate vertices avoidX. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V , we can route on the shortest X-constrained path between x, y ∈ X. This problem is motivated by Internet routing, where the presence of routin...

متن کامل

Forbidden families of configurations

A simple matrix is a (0, 1)-matrix with no repeated columns. For a (0, 1)matrix F , we say that a (0, 1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let ‖A‖ denote the number of columns of A. Let F be a family of matrices. We define the extremal function forb(m,F) = max{‖A‖ : A is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notices of the American Mathematical Society

سال: 2012

ISSN: 0002-9920,1088-9477

DOI: 10.1090/noti904